The Reduction Algorithm of Concept Lattice Based on the Improved Discernibility Matrix
نویسندگان
چکیده
This article proposes the concept lattice reduction based on the improved discernibility matrix using discernibility matrix of rough set, and with examples, proves that the improved reduction algorithm costs shorter time, makes reduction speed faster, and also saves storage space in comparison with the original discernibility matrix reduction algorithm. Keywordsformal context, concept lattice, discernibility matrix, reduct, core
منابع مشابه
Fault Detection of Bearings Using a Rule-based Classifier Ensemble and Genetic Algorithm
This paper proposes a reduct construction method based on discernibility matrix simplification. The method works with genetic algorithm. To identify potential problems and prevent complete failure of bearings, a new method based on rule-based classifier ensemble is presented. Genetic algorithm is used for feature reduction. The generated rules of the reducts are used to build the candidate base...
متن کاملAttribution Reduction Algorithm Based on Improved Binary Dicernibility Matrix
In order to reduce the time and space complexity of algorithm for attribute reduction based on discernibility matrix, and make it can deal directly with inconsistent decision-making system. A modificatory Binary discernibility matrix and attribution reduction algorithm based on binary dicernibility matrix are proposed. An ordering and the simple link in the algorithm have been increased. So red...
متن کاملA method for determining the key structure of 3D parts based on rough set and concept lattice
The key of parts model retrieval is how to complete the similarity calculation as quickly and accurately as possible. The similarity calculation is closely related to the model feature extraction. Concept lattice is a powerful tool in knowledge processing and analyzing, its reduction can improve the efficiency. In this paper, by mapping relationships among the parts functional surfaces and the ...
متن کاملTREE AUTOMATA BASED ON COMPLETE RESIDUATED LATTICE-VALUED LOGIC: REDUCTION ALGORITHM AND DECISION PROBLEMS
In this paper, at first we define the concepts of response function and accessible states of a complete residuated lattice-valued (for simplicity we write $mathcal{L}$-valued) tree automaton with a threshold $c.$ Then, related to these concepts, we prove some lemmas and theorems that are applied in considering some decision problems such as finiteness-value and emptiness-value of recognizable t...
متن کاملA New Discernibility Matrix Based on Distribution Reduction
In inconsistent information systems, the reduction based on positive region are not equivalent to that based on distribution reduction. The problem of discernibility matrix in algebra view is analyzed, and a new discernibility matrix based on distribution reduction is proposed in this paper. This algorithm considers whether the objects compared are consistent, analyses in detail the degree of i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016